Implementation of Elliptic Curve Digital Signature Algorithm
نویسندگان
چکیده
The Elliptic Curve Digital Signature Algorithm (ECDSA) is the elliptic curve analogue of the Digital Signature Algorithm (DSA). It was accepted in 1999 as an ANSI standard, and was accepted in 2000 as IEEE and NIST standards. It was also accepted in 1998 as an ISO standard, and is under consideration for inclusion in some other ISO standards. Unlike the ordinary discrete logarithm problem and the integer factorization problem, no sub exponential-time algorithm is known for the elliptic curve discrete logarithm problem. For this reason, the strength-per-key-bit is substantially greater in an algorithm that uses elliptic curves. This paper describes the implementation of ANSI X9.62 ECDSA over elliptic curve P-192, and discusses related security issues.
منابع مشابه
The new protocol blind digital signature based on the discrete logarithm problem on elliptic curve
In recent years it has been trying that with regard to the question of computational complexity of discrete logarithm more strength and less in the elliptic curve than other hard issues, applications such as elliptic curve cryptography, a blind digital signature method, other methods such as encryption replacement DLP. In this paper, a new blind digital signature scheme based on elliptic curve...
متن کاملUsing the Elliptic Curve Digital Signature Algorithm (ECDSA) with the MAXQ1103's Modular Arithmetic Accelerator (MAA) - AN4016
This application note describes the use and implementation of elliptic curve digital signature algorithm (ECDSA) on the MAXQ1103 microcontroller's modular arithmetic accelerator (MAA) module. Performance figures are given for a standard 160-bit curve specified in Standards for Efficient Cryptography published by Certicom®.
متن کاملSoftware Elliptic Curve Cryptography
In this thesis, we study the software implementation of the NIST-recommended elliptic curves over prime fields. Our implementation goals are to achieve a fast, small, and portable cryptographic library, which supports elliptic curve digital signature generation and verification. The implementation results are presented on a Pentium I1 448.81 MHz. We also consider the sliding window algorithm (S...
متن کاملImplementation and Performance Analysis of Elliptic Curve Digital Signature Algorithm
In this paper we present a novel method for obtaining fast software implementation of the Elliptic Curve Digital Signature Algorithm in the finite field GF(p) with an arbitrary prime modulus p of arbitrary length. The most important feature of the method is that it avoids bit-level operations which are slow on microprocessors and performs word-level operations which are significantly faster. Th...
متن کاملAn efficient blind signature scheme based on the elliptic curve discrete logarithm problem
Elliptic Curve Cryptosystems (ECC) have recently received significant attention by researchers due to their high performance such as low computational cost and small key size. In this paper a novel untraceable blind signature scheme is presented. Since the security of proposed method is based on difficulty of solving discrete logarithm over an elliptic curve, performance of the proposed scheme ...
متن کامل